On the Theory of Linear Trellises

نویسندگان

  • Ralf Koetter
  • Alexander Vardy
چکیده

Trellis linearity, rst considered by McEliece in 1996, turns out to be crucial in the study of tail-biting trellises. In this chapter, basic structural properties of linear trellises are investigated. A rigorous deeni-tion of linearity is given for both conventional and tail-biting trellises. An algorithm that determines in polynomial time whether a given trellis is linear is then derived. The relationship between linear trellises and the trellis product construction is discussed. The key result of this chapter is that a trellis | either conventional or tail-biting | is linear if and only if it factors into a product of elementary trellises. Some consequences of this factorization of linear trellises are established.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Algebraic Structure of Linear Trellises

Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In this paper we first develop a new algebraic framework for a systematic analysis of linear trellises which enables us to address open foundational questions. In...

متن کامل

On the Trellis Structure of Block Codes - Information Theory, IEEE Transactions on

Abst+act-The problem of minimizing the vertex count at a given time index in the trellis for a general (nonlinear) code is shown to be NP-complete. Examples are provided that show that 1) the minimal trellis for a nonlinear code may not be observable, i.e., some codewords may be represented by more than one path through the trellis and 2) minimizing the vertex count at one time index may be inc...

متن کامل

The structure of tail-biting trellises: minimality and basic principl

Basic structural properties of tail-biting trellises are investigated. We start with rigorous definitions of various types of minimality for tail-biting trellises. We then show that biproper and/or nonmergeable tail-biting trellises are not necessarily minimal, even though every minimal tail-biting trellis is biproper. Next, we introduce the notion of linear (or group) trellises and prove, by e...

متن کامل

Unifying Views of Tail-Biting Trellises for Linear Block Codes

This thesis presents new techniques for the construction and specification of linear tail-biting trellises. Tail-biting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis descriptions. Conventional trellises for block codes have a well understood underlying theory. On the other...

متن کامل

On the Intractability of Permuting a Block Code to Minimize Trellis Complexity [Correspondence] - Information Theory, IEEE Transactions on

A novel trellis design technique for both block and convolutional codes based on the Shannon product of component block codes is introduced. Using the proposed technique, structured trellises for block and convolutional codes have been designed. It is shown that the designed trellises are minimal and allow reduced complexity Viterbi decoding. Zndex Terms-Linear codes, trellis structure, product...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002